- complete factorization
- мат.полная факторизация
English-Russian scientific dictionary. 2008.
complete factorization
Смотреть что такое "complete factorization" в других словарях:
Graph factorization — Not to be confused with Factor graph. 1 factorization of Desargues graph: each color class is a 1 factor … Wikipedia
Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… … Wikipedia
Stinespring factorization theorem — In mathematics, Stinespring s dilation theorem, also called Stinespring s factorization theorem, is a result from operator theory that represents any completely positive map on a C* algebra as a composition of two completely positive maps each of … Wikipedia
Ruffini's rule — In mathematics, Ruffini s rule allows the rapid division of any polynomial by a binomial of the form x − r . It was described by Paolo Ruffini in 1809. Ruffini s rule is a special case of long division when the divisor is a linear factor. Ruffini … Wikipedia
Greatest common divisor of two polynomials — Informally, the greatest common divisor (GCD) of two polynomials p ( x ) and q ( x ) is the biggest polynomial that divides evenly into both p ( x ) and q ( x ). The definition is modeled on the concept of the greatest common divisor of two… … Wikipedia
Pollard's rho algorithm — is a special purpose integer factorization algorithm. It was invented by John Pollard in 1975. It is particularly effective at splitting composite numbers with small factors.Core ideasThe rho algorithm is based on Floyd s cycle finding algorithm… … Wikipedia
Fermat number — In mathematics, a Fermat number, named after Pierre de Fermat who first studied them, is a positive integer of the form:F {n} = 2^{2^{ overset{n} {} + 1where n is a nonnegative integer. The first nine Fermat numbers are OEIS|id=A000215:As of|2008 … Wikipedia
Sufficient statistic — In statistics, a sufficient statistic is a statistic which has the property of sufficiency with respect to a statistical model and its associated unknown parameter, meaning that no other statistic which can be calculated from the same sample… … Wikipedia
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
Sufficiency (statistics) — In statistics, sufficiency is the property possessed by a statistic, with respect to a parameter, when no other statistic which can be calculated from the same sample provides any additional information as to the value of the parameter cite… … Wikipedia
